99A - Help Far Away Kingdom - CodeForces Solution


strings *800

Please click on ads to support us..

Python Code:

s=input()
a=s.split('.')
if a[0][-1]=='9':
        print("GOTO Vasilisa.")
else:
        if int(a[1][0]) > 4:
        print(int(a[0])+1)
    else:
        print(int(a[0]))

C++ Code:

#include <bits/stdc++.h>
using namespace std;

int main() {
  string str;
  cin >> str;
  int n = str.size();
  int dot = 0;
  for (int i = 0; i < n; i++) {
    if (str[i] == '.') {
      dot = i;
      break;
    }
  }
  if (str[dot - 1] == '9') {
    cout << "GOTO Vasilisa.";
    return 0;
  }
  if (str[dot + 1] == '5' || str[dot + 1] == '6' || str[dot + 1] == '7' ||
      str[dot + 1] == '8' || str[dot + 1] == '9') {
    str[dot - 1] += 1;
  }
  for (int i = 0; i < dot; i++) {
    cout << str[i];
  }
}


Comments

Submit
0 Comments
More Questions

1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST
1143B - Nirvana
1285A - Mezo Playing Zoma
919B - Perfect Number
894A - QAQ
1551A - Polycarp and Coins
313A - Ilya and Bank Account
1469A - Regular Bracket Sequence
919C - Seat Arrangements
1634A - Reverse and Concatenate
1619C - Wrong Addition
1437A - Marketing Scheme
1473B - String LCM
1374A - Required Remainder
1265E - Beautiful Mirrors
1296A - Array with Odd Sum
1385A - Three Pairwise Maximums
911A - Nearest Minimums
102B - Sum of Digits
707A - Brain's Photos
1331B - Limericks
305B - Continued Fractions
1165B - Polycarp Training